منابع مشابه
Optimization II: Dynamic Programming
In the last chapter, we saw that greedy algorithms are efficient solutions to certain optimization problems. However, there are optimization problems for which no greedy algorithm exists. In this chapter, we will examine a more general technique, known as dynamic programming, for solving optimization problems. Dynamic programming is a technique of implementing a top-down solution using bottom-u...
متن کاملLecture 25 — Dynamic Programming II
The top-down approach is based on running the recursive code as is, generating implicitly the recursion structure from the root of the DAG down to the leaves. Each time a solution to a smaller instance is found for the first time it generates a mapping from the input argument to its solution. This way when we come across the same argument a second time we can just look up the solution. This pro...
متن کاملApproximate Dynamic Programming—ii: Algorithms
• Option Pricing. An American option allows us to buy or sell an asset at any time up to a specified time, where we make money when the price goes under or over (respectively) a set strike price. Valuing the option requires finding an optimal policy for determining when to exercise the option. • Playing Games. Computer algorithms have been designed to play backgammon, bridge, chess, and recentl...
متن کاملInverse integer programming
We consider the integer programming version of inverse optimization. Using superadditive duality, we provide a polyhedral description of the set of inversefeasible objectives. We then describe two algorithmic approaches for solving the inverse integer programming problem.
متن کاملInverse Stochastic Linear Programming
Inverse optimization perturbs objective function to make an initial feasible solution optimal with respect to perturbed objective function while minimizing cost of perturbation. We extend inverse optimization to two-stage stochastic linear programs. Since the resulting model grows with number of scenarios, we present two decomposition approaches for solving these problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
سال: 1977
ISSN: 0373-6385,1883-2172
DOI: 10.2206/kyushumfs.31.25